Application of Discrete Pruned Enumeration in Solving BDD

The bounded distance decoding (BDD) is a fundamental problem in lattice-based cryptography which derived from the closest vector (CVP). In this paper, we adapt lattice enumeration with discrete pruning, burgeoning method for shortest (SVP), to solve BDD various cryptanalysis scenarios using direct method. We first transfer basic definition involved pruning technique SVP CVP, prove corresponding properties and give specific procedures of algorithm. Additionally, use interpret classical CVP algorithms, including Babai’s nearest plane Lindner–Peikert planes, can be regarded as pruned on some special sets. propose three probability models runtime analysis accurately estimate cost our algorithm different application scenarios. study mainly LWE-based cryptosystem DSA partially known nonces. experimental results show that new has higher efficiency than previous algorithms directly BDD, plane(s) strategies, are able recover secret less leaked information works.